Counterexamples in Probabilistic Model Checking
نویسندگان
چکیده
This paper considers algorithms for counterexample generation for (bounded) probabilistic reachability properties in fully probabilistic systems. Finding the strongest evidence (i.e, the most probable path) violating a (bounded) until-formula is shown to be reducible to a single-source (hop-constrained) shortest path problem. Counterexamples of smallest size that are mostly deviating from the required probability bound can be computed by adopting (partially new hopconstrained) k shortest paths algorithms that dynamically determine k.
منابع مشابه
Counterexample Generation for Discrete-Time Markov Models: An Introductory Survey
This paper is an introductory survey of available methods for the computation and representation of probabilistic counterexamples for discrete-time Markov chains and probabilistic automata. In contrast to traditional model checking, probabilistic counterexamples are sets of finite paths with a critical probability mass. Such counterexamples are not obtained as a by-product of model checking, bu...
متن کاملDiPro - A Tool for Probabilistic Counterexample Generation
The computation of counterexamples for probabilistic model checking has been an area of active research over the past years. In spite of the achieved theoretical results in this field, there is no freely available tool that allows for the computation and representation of probabilistic counterexamples. We present an open source tool called DiPro that can be used with the PRISM and MRMC probabil...
متن کاملHigh-Level Counterexamples for Probabilistic Automata
Providing compact and understandable counterexamples for violated system properties is an essential task in model checking. Existing works on counterexamples for probabilistic systems so far computed either a large set of system runs or a subset of the system’s states, both of which are of limited use in manual debugging. Many probabilistic systems are described in a guarded command language li...
متن کاملDirected diagnostics of system dependability models
References: 1) Husain Aljazzar and Stefan Leue: Debugging of Dependability Models Using Interactive Visualization of Counterexamples, to appear in proceedings of QEST 2008. 2) Husain Aljazzar and Stefan Leue: Directed explicit state-space search in the generation of counterexamples for probabilistic reachability, 2008, submitted for journal publication. 3) Husain Aljazzar and Stefan Leue: Count...
متن کاملModel exploration and analysis for quantitative safety refinement in probabilistic B
The role played by counterexamples in standard system analysis is well known; but less common is a notion of counterexample in probabilistic systems refinement. In this paper we extend previous work using counterexamples to inductive invariant properties of probabilistic systems, demonstrating how they can be used to extend the technique of bounded model checking-style analysis for the refineme...
متن کامل